An indicator for the switch from derivative-free to derivative-based optimization

An indicator for the switch from derivative-free to derivative-based optimization

In some optimization problems found in applications, the derivatives of the objective function can be computed or approximated but at an expensive cost, and it is desirable to know when to use derivative-free methods (such as direct search, for instance) or derivativebased methods (such as gradient or quasi-Newton methods). Derivative-free methods may achieve a steady initial progress for some ...

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

Derivative Free Optimization

Derivative-Free Optimization

In many engineering applications it is common to find optimization problems where the cost function and/or constraints require complex simulations. Though it is often, but not always, theoretically possible in these cases to extract derivative information efficiently, the associated implementation procedures are typically non-trivial and time-consuming (e.g., adjoint-based methodologies). Deriv...

Derivative free optimization method

Derivative free optimization (DFO) methods are typically designed to solve optimization problems whose objective function is computed by a “black box”; hence, the gradient computation is unavailable. Each call to the “black box” is often expensive, so estimating derivatives by finite differences may be prohibitively costly. Finally, the objective function value may be computed with some noise, ...